Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 12315 - The Starflyer Agents / gen.cpp
blob70d7ff91705c860a0692ad2b1a388a354da54278
1 using namespace std;
2 #include <algorithm>
3 #include <iostream>
4 #include <iterator>
5 #include <numeric>
6 #include <sstream>
7 #include <fstream>
8 #include <cassert>
9 #include <climits>
10 #include <cstdlib>
11 #include <cstring>
12 #include <string>
13 #include <cstdio>
14 #include <vector>
15 #include <cmath>
16 #include <queue>
17 #include <deque>
18 #include <stack>
19 #include <list>
20 #include <map>
21 #include <set>
23 #define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
24 #define For(i, a, b) for (int i=(a); i<(b); ++i)
25 #define D(x) cout << #x " is " << x << endl
27 int main(){
28 int Casos = 1000;
29 for (int c = 0; c < Casos; ++c) {
30 printf("random%d 3\n", c);
31 for (int i = 0; i < 3; ++i){
32 printf("a(");
33 for (int j = 0; j < 6; ++j) {
34 if (rand() % 100 < 50) { // function
35 printf("b(%c)", rand() % 6 + 'A');
36 } else {
37 printf("%c", rand() % 6 + 'A');
39 if (j + 1 < 6) printf(",");
41 printf(")\n");
44 return 0;